Theory of computation - PDFSEARCH.IO - Document Search Engine

Theory of computation
Results: 2087

#	Item
891	A. Evans Dept. of Computing, University of York [removed] Rigorous Development in UML Add to Reading List Source URL: www.cs.york.ac.uk Language: English - Date: 2003-02-04 09:56:28 Infographics Information science Communication design Data modeling Automata theory State diagram Unified Modeling Language Finite-state machine ECO UML diagrams Models of computation Diagrams
892	Visualization and Interaction in the Computer Science Formal Languages Course with JFLAP Magdalena Procopiuc1, Octavian Procopiuc and Susan H. Rodger1 Computer Science Department, Box[removed]Duke University Durham, North Add to Reading List Source URL: www.cs.duke.edu Language: English - Date: 1998-09-22 13:05:10 Theoretical computer science Combinatorics Mathematics Deterministic pushdown automaton Pushdown automaton Finite-state machine Alphabet Formal grammar Regular expression Automata theory Formal languages Models of computation
893	Invariants for equivalence of finite automata Mike Spivey Let S = (S, Σ, δS , s0 , FS ) and T = (T , Σ, δT , t0 , FT ) be two deterministic finite automata with the same alphabet Σ. We say S and T are equivalent if, Add to Reading List Source URL: spivey.oriel.ox.ac.uk Language: English - Date: 2010-02-09 12:35:41 Equivalence relation Structure Deterministic finite automaton If and only if Complementation of Büchi automaton Finite state transducer Automata theory Mathematics Models of computation
894	cSplash, Event for High School Students, Courant Institute What is the Numerical Halting Problem? Chee Yap Computer Science Dept, Courant, NYU Mar 29, 2008 Add to Reading List Source URL: cs.nyu.edu Language: English - Date: 2013-02-22 12:21:24 Computer science Theory of computation Models of computation Formal methods Alan Turing Computability Halting problem Turing machine Reduction Theoretical computer science Applied mathematics Computability theory
895	Combining Static Model Checking with Dynamic Enforcement using the Statecall Policy Language Anil Madhavapeddy Imperial College, South Kensington, London SW1 2AZ, UK [removed] Add to Reading List Source URL: anil.recoil.org Language: English - Date: 2013-09-29 14:14:18 Computing Programming language theory Promela Finite-state machine ALGOL 68 Software engineering Automata theory Models of computation
896	Upper and Lower Bounds on the Cost of a Map-Reduce Computation ∗ Foto N. Afrati† , Anish Das Sarma] , Semih Salihoglu‡ , Jeffrey D. Ullman‡ National Technical University of Athens, ] Google Research, ‡ Stanford Add to Reading List Source URL: www.vldb.org Language: English - Date: 2013-04-25 03:37:48 Quantum complexity theory Distributed computing architecture MapReduce Parallel computing Computational complexity theory PP Coding theory Algorithm Function Mathematics Theoretical computer science Applied mathematics
897	Optimization of Massive Pattern Queries by Dynamic Configuration Morphing Nikolay Laptev #1 , Carlo Zaniolo #2 # University of California, Los Angeles Add to Reading List Source URL: labs.yahoo.com Language: English - Date: 2015-02-04 18:38:47 Formal languages Computer science Applied mathematics Pattern matching Regular expressions Nondeterministic finite automaton Deterministic finite automaton Nested word Finite-state machine Automata theory Models of computation Theoretical computer science
898	A Type System for Expressive Security Policies∗ David Walker Cornell University Abstract Add to Reading List Source URL: www.cs.cornell.edu Language: English - Date: 1999-06-07 14:58:01 Logic Mathematics Semantics Models of computation Formal languages First-order logic Type safety Predicate Functional predicate Automata theory Model theory Mathematical logic
899	LLparse and LRparse: Visual and Interactive Tools for Parsing Stephen A. Blythe, Michael C. James, and Susan H. Rodger1 Department of Computer Science Rensselaer Polytechnic Institute Troy, NY[removed]email: rodger@cs Add to Reading List Source URL: www.cs.duke.edu Language: English - Date: 2003-06-18 09:05:39 Software engineering Theoretical computer science Automata theory Models of computation LR parser LL parser Parsing Bottom-up parsing Parsing table Programming language implementation Compiler construction Formal languages
900	From System F to Typed Assembly Language∗ Greg Morrisett David Walker Karl Crary Add to Reading List Source URL: www.cs.cornell.edu Language: English - Date: 1999-04-14 16:12:44 Type theory Procedural programming languages Data types Functional languages Models of computation Type safety Symbol Pointer Closure Software engineering Computing Programming language theory

UPDATE